An optimal local search procedure for manpower scheduling in call centers
نویسندگان
چکیده
We are concerned with the minimization of multimodular functions. We show that for these functions local search gives the global optimum for a well-deened nite neighborhood. We apply this to a problem arising from manpower scheduling in call centers which has a multimodular objective function.
منابع مشابه
Optimal shift scheduling with a global service level constraint
We study a shift scheduling problem for call centers with an overall service level objective. We prove a property of this problem, called multimodularity, that ensures that a local search algorithm terminates with a globally optimal solution. We report on computations we did with real call center data.
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملمدل حل مبتنی بر جستجوگر محلی ژنتیک برای مساله زمان بندی استقرار کارگاهی تعمیم یافته با زمانهای عملیات قابل کنترل
Although incorporating complexities and flexibilities of real world manufacturing systems into classic scheduling problems results in problems with greater complexity, it has immense theoretical and practical importance due to its impressive effect on system performance. In this research, three basic assumptions of a job shop scheduling problem have been revised to develop a model with three ty...
متن کاملSolving a bi-objective manpower scheduling problem considering the utility of objective functions
This paper presents a novel bi-objective manpower scheduling problem that minimizes the penalty resulted from employees’ assignment at lower skill levels than their real skill and maximizes employees’ utility for working at a special skill level in some shifts or on some days. Employees are classified in two specialist groups and three skill levels in each specialization. In addition, the prese...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کامل